By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 23, Issue 5, pp. 895-1091

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems

A. Das, K. Thulasiraman, and V. K. Agarwal

pp. 895-905

BibTeX  Abstract Full Text:  PDF

Improved Algorithms for Bipartite Network Flow

Ravindra K. Ahuja, James B. Orlin, Clifford Stein, and Robert E. Tarjan

pp. 906-933

BibTeX  Abstract Full Text:  PDF

New Resultant Inequalities and Complex Polynomial Factorization

V. Y. Pan

pp. 934-950

BibTeX  Abstract Full Text:  PDF

Randomized Algorithms for Multiprocessor Page Migration

Jeffery Westbrook

pp. 951-965

BibTeX  Abstract Full Text:  PDF

Near-Optimal Time-Space Tradeoff for Element Distinctness

Andrew Chi-Chih Yao

pp. 966-975

BibTeX  Abstract Full Text:  PDF

Existence and Construction of Edge-Disjoint Paths on Expander Graphs

Andrei Z. Broder, Alan M. Frieze, and Eli Upfal

pp. 976-989

BibTeX  Abstract Full Text:  PDF

Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain

Avrim L. Blum

pp. 990-1000

BibTeX  Abstract Full Text:  PDF

Computing with Noisy Information

Uriel Feige, Prabhakar Raghavan, David Peleg, and Eli Upfal

pp. 1001-1018

BibTeX  Abstract Full Text:  PDF

On Competitive Group Testing

Ding-Zhu Du and Haesun Park

pp. 1019-1025

BibTeX  Abstract Full Text:  PDF

A Uniform Circuit Lower Bound for the Permanent

Eric Allender and Vivek Gore

pp. 1026-1049

BibTeX  Abstract Full Text:  PDF

The Joint Distribution of Elastic Buckets in Multiway Search Trees

William Lew and Hosam M. Mahmoud

pp. 1050-1074

BibTeX  Abstract Full Text:  PDF

Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm

Richard Cole

pp. 1075-1091

BibTeX  Abstract Full Text:  PDF